Collisions for the LPS Expander Graph Hash Function
نویسندگان
چکیده
We analyse the hash function family based on walks in LPS Ramanujan graphs recently introduced by Charles et al. We present an algorithm for finding collisions that runs in quasi-linear time in the length of the hashed value. A concrete instance of the hash function is considered, based on a 100-digit prime. A short collision is given, together with implementation details.
منابع مشابه
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Zémor and Tillich [16], but it was not clear whether computing preimages was also easy for this hash function. We present a probabilistic polynomial time algorithm solving this problem. Subsequently, we study the Morgenstern hash, an interesting variant of LPS hash, and break this function as well....
متن کاملA Probabilistic Study on Combinatorial Expanders and Hashing
This paper gives a new way of showing that certain constant degree graphs are graph expanders. This is done by giving new proofs of expansion for three permutations of the Gabber–Galil expander. Our results give an expansion factor of 3 16 for subgraphs of these three-regular graphs with (p− 1)2 inputs for p prime. The proofs are not based on eigenvalue methods or higher algebra. The same metho...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملFast Pseudorandom Functions Based on Expander Graphs
We present direct constructions of pseudorandom function (PRF) families based on Goldreich’s one-way function. Roughly speaking, we assume that non-trivial local mappings f : {0, 1} → {0, 1} whose input-output dependencies graph form an expander are hard to invert. We show that this one-wayness assumption yields PRFs with relatively low complexity. This includes weak PRFs which can be computed ...
متن کاملGenerators from Communication Complexity
where x ∈ {0, 1}ks, y ∈ {0, 1}s, and Γk : {0, 1}ks × {0, 1}s → {0, 1}ks is some function that can “recycle the randomness in x”. In the INW-generator, Γ is the neighbor function of a suitable expander graph or it is a suitable extractor. Nisan’s generator can also be cast in the framework of (1), but the definition is a bit subtle. Here the string x is of length (2k − 1) · s and of the form x =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008